Hierarchical Bloom Filter Trees for Approximate Matching
نویسندگان
چکیده
منابع مشابه
Hierarchical Bloom Filter Trees for Approximate Matching
Bytewise approximate matching algorithms have in recent years shown significant promise in detecting files that are similar at the byte level. This is very useful for digital forensic investigators, who are regularly faced with the problem of searching through a seized device for pertinent data. A common scenario is where an investigator is in possession of a collection of “known-illegal” files...
متن کاملNew Bloom Filter Architecture For String Matching
Implementation of the Bloom filter for plagiarism detection in full text document has a problem on how to identify the same terms from different location. Location identifier can be hashed in offline mode since the collection is static. By this approach, the computation speed of the Bloom filter can be improved. Two new Bloom filter architectures are proposed in this study to overcome the probl...
متن کاملAccelerating Boolean Matching Using Bloom Filter
Boolean matching is a fundamental problem in FPGA synthesis, but existing Boolean matchers are not scalable to complex PLBs (programmable logic blocks) and large circuits. This paper proposes a filter-based Boolean matching method, F-BM, which accelerates Boolean matching using lookup tables implemented by Bloom filters storing precalculated matching results. To show the effectiveness of the pr...
متن کاملIndexed Hierarchical Approximate String Matching
We present a new search procedure for approximate string matching over suffix trees. We show that hierarchical verification, which is a well-established technique for on-line searching, can also be used with an indexed approach. For this, we need that the index supports bidirectionality, meaning that the search for a pattern can be updated by adding a letter at the right or at the left. This tu...
متن کاملAn Efficient Bloom Filter Based Solution for Multiparty Private Matching
The issue of privacy becomes more and more important. On the other hand, online collaboration among different parties is almost unavoidable. How to allow collaboration while protecting one’s privacy is an important problem and attracted a lot of attention. Unfortunately, most of the problems in this area still remain unsolved. In this paper, we investigate one of the fundamental problems called...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: The Journal of Digital Forensics, Security and Law
سال: 2018
ISSN: 1558-7223
DOI: 10.15394/jdfsl.2018.1489